One Digital Signature Scheme in Semimodule over Semiring
نویسنده
چکیده
A modernization of signature scheme published in (Sakalauskas, 2004) is presented. This scheme differs from the prototype by its structure and uses a more general algebraic systems. It has a higher security and shorter key length and is also more computationally effective. The introduced new algebraic structures, semiring and semimodule, are mutually compatible algebraic systems. The semiring is a set of operators acting in a semimodule as endomorphisms. There is postulated that action operation has a one-way function (OWF) property. The compatibility of both algebraic structures’ means that the action operation has right and left distributivity property with respect to the additive operation defined in semimodule and semiring. Two other essential OWFs are defined. The latter are based on known constructions and have a greater complexity than other recognized hard problems such as conjugator search problem in noncommutative groups, for example.
منابع مشابه
Secured Digital Signature Scheme using Polynomials over Non-Commutative Division Semirings
Digital signatures are probably the most important and widely used cryptographic primitive enabled by public key technology, and they are building blocks of many modern distributed computer applications, like, electronic contract signing, certified email, and secure web browsing etc. But many existing signatures schemes lie in the intractability of problems closely related to the number theory ...
متن کاملNew Digital Signature Scheme Using Multiple Private Keys over Non-Commutative Division Semirings
In this paper, we propose a new signature scheme connecting two private keys and two public keys based on general non-commutative division semiring. The key idea of our technique engrosses three core steps. In the first step, we assemble polynomials on additive structure of non-commutative division semiring and take them as underlying work infrastructure. In the second step, we generate first s...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملWeakly prime ternary subsemimodules of ternary semimodules
In this paper we introduce the concept of weakly prime ternary subsemimodules of a ternary semimodule over a ternary semiring and obtain some characterizations of weakly prime ternary subsemimodules. We prove that if $N$ is a weakly prime subtractive ternary subsemimodule of a ternary $R$-semimodule $M$, then either $N$ is a prime ternary subsemimodule or $(N : M)(N : M)N = 0$. If $N$ is a $Q$-...
متن کاملGalois Connections Between Semimodules and Applications in Data Mining
In [1] a generalisation of Formal Concept Analysis was introduced with data mining applications in mind, K-Formal Concept Analysis, where incidences take values in certain kinds of semirings, instead of the standard Boolean carrier set. A fundamental result was missing there, namely the second half of the equivalent of the main theorem of Formal Concept Analysis. In this continuation we introdu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Informatica, Lith. Acad. Sci.
دوره 16 شماره
صفحات -
تاریخ انتشار 2005